Computing Symmetric Block Cipher Using Linear Algebraic Equation
نویسندگان
چکیده
منابع مشابه
Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT
The contributions of this paper include the first linear hull and a revisit of the algebraic cryptanalysis of reduced-round variants of the block cipher PRESENT, under known-plaintext and ciphertextonly settings. We introduce a pure algebraic cryptanalysis of 5-round PRESENT and in one of our attacks we recover half of the bits of the key in less than three minutes using an ordinary desktop PC....
متن کاملAlgebraic methods in block cipher cryptanalysis
This thesis is a contribution to the field of algebraic cryptanalysis. Specifically the following topics have been studied: • We construct and analyze Feistel and SLN ciphers that have a sound design strategy against linear and differential cryptanalysis. The encryption process for these cipher can be described by very simple polynomial equations. For a block and key size of 128 bits, we presen...
متن کاملProposed Model of Block Based Symmetric Cipher
This paper is presenting cryptography model of block based cipher technique. This model is divided into two sub model one is encryption model and other is decryption model. Using encryption model, encrypt any type of data like text, image, pdf, audio. Using decryption model, decrypt same data. Due to the simplicity of the proposed model, it is very efficient. This model is also much secured due...
متن کاملImproved Linear Cryptanalysis of SMS4 Block Cipher
SMS4 is a block cipher standard used for wireless communications in China. We analyze a reduced versions of SMS4 by the multidimensional linear cryptanalysis method. Our analysis shows that the 23-round of SMS4 can be attacked with 2 data complexity and time complexity less than exhaustive search.
متن کاملNew Linear Attacks on Block Cipher GOST
Defined in the standard GOST 28147-89, GOST is a Soviet and Russian government standard symmetric-key block cipher. GOST has the 64-bit block size and a key length of 256 bits. It is a Feistel network of 32 rounds. In 2010, GOST was submitted to ISO 18033 to become a worldwide industrial encryption standard. GOST 28147-89 has also been published as informational RFC 5830 with IETF. In this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Communication Networks and Security
سال: 2011
ISSN: 2231-1882
DOI: 10.47893/ijcns.2011.1001